On-line scheduling of parallel jobs on two machines
نویسندگان
چکیده
منابع مشابه
On-line scheduling of parallel jobs on two machines
We study the problem of on-line scheduling of parallel jobs on two machines. The jobs are parallel in the sense that each of them specifies the number of processors, in this case 1 or 2, required for simultaneous processing. The jobs are presented one by one. Upon receiving a job, we must assign the job to a time slot in the schedule before the next job is presented. No re-assignment is allowed...
متن کاملOnline scheduling of two type parallel jobs on identical machines
In this paper we consider an online scheduling of parallel jobs with preemption on identical machines, where jobs arrive over time. The objective is to minimize the makespan. For the problem that jobs have only two possible widths mj = 1 or m, we present an optimal online algorithm by using " temporary schedule " .
متن کاملScheduling split - jobs on parallel machines
In classical shop scheduling, the tasks corresponding to a job may not be executed in parallel, i.e., their processing times may not overlap. In case these tasks are processes , independent of each other, this assumption is no longer justified. We consider corresponding scheduling problems where each job splits into a number of pairwise independent processes that have to be executed on dedicate...
متن کاملRandomized On-Line Scheduling of Parallel Jobs
W e study randomized on-line scheduling on mesh machines. W e show that for scheduling independent jobs randomized algorithms can achieve a signijicanily better performance than de iemin i s t i c ones; on the oiher hand with dependencies randomization does not help.
متن کاملOn-Line Scheduling of Parallel Jobs
Abstract. Online scheduling of parallel jobs is a problem where jobs with unit processing time and integer release times and deadlines are scheduled on a set of processors. Every job requests certain number of processors. In our setting processors are organized as a hypercube and jobs are scheduled on subhypercubes of the hypercube. The objective is to schedule as many jobs as possible between ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Discrete Algorithms
سال: 2008
ISSN: 1570-8667
DOI: 10.1016/j.jda.2006.07.005